Effectiveness of Skyline Computation over Spatial Data

Skyline query processing has been investigated extensively in recent years, mostly for only one query reference point. An example of a single-source skyline query is to find hotels which are cheap and close to the beach (an absolute query), or close to a user-given location (a relatively query). A multi-source skyline query considers several query points at the same time In this paper, we consider the problem of efficient multisource skyline query processing in road networks. It is not only the first effort to consider multi-source skyline query in road networks but also the first effort to process the relative skyline queries where the network distance between two locations needs to be computed on-the-fly. The main contributions of this paper are listed as follows: This paper presents a novel skyline algorithm SSPL on spatial data, which can utilize some small reconstructed datastructures to reduce I/O cost significantly.. The behavior analysis of SSPL is proposed to determine scan depth of the sorted positional index lists.